Piling-up Lemma for Markov Chains
نویسندگان
چکیده
منابع مشابه
Extended Linear Cryptanalysis and Extended Piling-up Lemma
In this paper, we extend the idea of piling-up lemma and linear cryptanalysis applied to symmetric-key block ciphers. We also examine this new method of Extended Linear Cryptanalysis on two-round Rijndael, which is designed to be immune to linear cryptanalysis attack. Even though our results do not show much surprise on two-round Rijndael, the effects on other block ciphers remain open questions.
متن کاملHow Biased Are Linear Biases ∗
In this paper we re-visit the Matsui’s linear cryptanalysis. The linear attack on the full round DES was the first attack that has been verified experimentally. Matsui extended one-round linear approximations to a linear mask of plaintext-ciphertext pairs by means of his piling-up lemma. The assumption of the lemma, the independence of the random variables in the round approximations, is hopefu...
متن کاملHow Far Can We Go Beyond Linear Cryptanalysis?
Several generalizations of linear cryptanalysis have been proposed in the past, as well as very similar attacks in a statistical point of view. In this paper, we define a rigorous general statistical framework which allows to interpret most of these attacks in a simple and unified way. Then, we explicitely construct optimal distinguishers, we evaluate their performance, and we prove that a bloc...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملWalsh-Hadamard Transform and Cryptographic Applications in Bias Computing
Walsh-Hadamard transform is used in a wide variety of scientific and engineering applications, including bent functions and cryptanalytic optimization techniques in cryptography. In linear cryptanalysis, it is a key question to find a good linear approximation, which holds with probability (1 + d)/2 and the bias d is large in absolute value. Lu and Desmedt (2011) take a step toward answering th...
متن کامل